A Class of Pareto Archived Evolution Strategy Algorithms Using Immune Inspired Operators for Ab-Initio Protein Structure Prediction
نویسندگان
چکیده
In this work we investigate the applicability of a multiobjective formulation of the Ab-Initio Protein Structure Prediction (PSP) to medium size protein sequences (46-70 residues). In particular, we introduce a modified version of Pareto Archived Evolution Strategy (PAES) which makes use of immune inspired computing principles and which we will denote by “I-PAES”. Experimental results on the test bed of five proteins from PDB show that PAES, (1+1)-PAES and its modified version I-PAES, are optimal multiobjective optimization algorithms and the introduced mutation operators, mut1 and mut2, are effective for the PSP problem. The proposed I-PAES is comparable with other evolutionary algorithms proposed in literature, both in terms of best solution found and computational cost.
منابع مشابه
Modified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کاملA COMPARISON OF MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS by Crina Gro ş
In this paper a comparison of the most recent algorithms for Multiobjective Optimization is realized. For this comparison are used the followings algorithms: Strength Pareto Evolutionary Algorithm (SPEA), Pareto Archived Evolution Strategy (PAES), Nondominated Sorting Genetic Algorithm (NSGA II), Adaptive Pareto Algorithm (APA). The comparison is made by using five test functions.
متن کاملA Comparative Assessment of Memetic, Evolutionary, and Constructive Algorithms for the Multiobjective d-MST Problem
Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research with important applications in network design. In this paper, we consider the degree-constrained multi-objective MST problem, which is NP-hard. On fteen benchmark instances, we compare the performance of three diierent algorithms: the Pareto archived evolution strategy (PAES); a new multiobjecti...
متن کاملAn ensemble approach to protein fold classification by integration of template-based assignment and support vector machine classifier
Motivation Protein fold classification is a critical step in protein structure prediction. There are two possible ways to classify protein folds. One is through template-based fold assignment and the other is ab-initio prediction using machine learning algorithms. Combination of both solutions to improve the prediction accuracy was never explored before. Results We developed two algorithms, H...
متن کاملThe Pareto Archived Evolution Strategy : A New Baseline Algorithm for Pareto Multiobjective Optimisation
Most popular evolutionary algorithms for multiobjective optimisation maintain a population of solutions from which individuals are selected for reproduction. In this paper, we introduce a simpler evolution scheme for multiobjective problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible non-trivial algorithm capable of generating di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005